Reduction of Routing Area in High-Level Synthesis
نویسنده
چکیده
We address the problem of the wiring area as a result of high-level synthesis. When generating the layout of a circuit by ‘compiling’ a high-level hardware description, generally the netlist is computed after the scheduling and allocation phases. The result of high-level synthesis systems in most cases are interconnection nets based on multiplexer structures with a high connectivity. This results in layouts where the silicon area occupied by the interconnection at RT level has about the same size as the area occupied by the operational components. Although a high connectivity need not to be bad in all cases, we present a possible approach for reducing the wiring area. We replace the multiplexers by bus-oriented structures to avoid the central multiplexer modules which may be as large as the other functional units. The connection logic will become decentralized by using tri-state outputs at all functional units, memories, and registers. However, we also want to start a discussion for high-level synthesis to consider the interconnection already in the earlier synthesis phases. The goal should be the synthesis of circuits where the connectivity is comparable to manual designs without reducing the system performance. But this is not possible by only optimizing the number of functional units first and then computing the netlist from a fixed interconnection graph. Reduction of Routing Area in High-Level Synthesis
منابع مشابه
Data Routing : a Paradigm for E cient Data - Path Synthesis andCode
This paper describes a new and eeective approach to register and interconnect optimisation, which is applicable in a dual context : to reduce chip area in high-level synthesis, and to reduce resource load (and thus execution time) in retargetable code generation. The key idea is to carefully optimise the way in which data is transferred between functional units. The impact on high-level synthes...
متن کاملEfficient Multiplexer Synthesis
The multiplexer is a common standard sub-circuit used frequently in the datapath logic of complex designs, typically to provide a path for routing operands to operations and operation results to destination registers. During RTL synthesis, multiplexers are used for realizing ifthen-else and case statements in the RTL design description. In this paper, we describe a new heuristic algorithm for s...
متن کاملEvaluation of antioxidant potential and reduction capacity of some plant extracts in silver nanoparticle synthesis
The green synthesis of metallic nanoparticles is an active research area in nanotechnology. In the present study, antioxidant potential, total reducing capacity and silver nanoparticles (Ag NPs) synthetic potential of methanolic leaf extracts of seven plant species were evaluated and compared. Antioxidant capacity, expressed as µmol Trolox equivalents g-1 DW (µmol TE g-1 DW), ranged from 116.0 ...
متن کاملA Capacitated Vehicle Routing Problem considering Satisfaction Level of Customers: A Genetic Algorithm
Capacitated vehicle routing problem (CVRP) is one of the most well-known and applicable issues in the field of transportation. It has been proved to be an NP-Complete problem. To this end, it is needed to develop a high-performance algorithm to solve the problem, particularly in large scales. This paper develops a novel mathematical model for the CVRP considering the satisfaction level of deman...
متن کاملSimultaneous reduction of emissions (CO2 and CO) and optimization of production routing problem in a closed-loop supply chain
Environmental pollution and emissions, along with the increasing production and distribution of goods, have placed the future of humanity at stake. Today, measures such as the extensive reduction in emissions, especially of CO2 and CO, have been emphasized by most researchers as a solution to the problem of environmental protection. This paper sought to explore production routing pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007